Memetic Algorithm for Dynamic Optimization Problems
نویسندگان
چکیده
منابع مشابه
Memetic Algorithm for Dynamic Optimization Problems
Dynamic optimization problems has attracted much attention of researchers. However, due to complexity and uncertainty to solve dynamic optimization problems, it very difficult to find out the optimum solution that could be changed over time. Thus, it is necessary to develop efficient or improved an algorithms to solve dynamic optimization problems. A memetic algorithm that based on local search...
متن کاملMemetic Algorithms for Dynamic Optimization Problems
Dynamic optimization problems challenge traditional evolutionary algorithms seriously since they, once converged, cannot adapt quickly to environmental changes. This chapter investigates the application of memetic algorithms, a class of hybrid evolutionary algorithms, for dynamic optimization problems. An adaptive hill climbing method is proposed as the local search technique in the framework o...
متن کاملMemetic algorithm using multi-surrogates for computationally expensive optimization problems
In this paper, we present a Multi-Surrogates Assisted Memetic Algorithm (MSAMA) for solving optimization problems with computationally expensive fitness functions. The essential backbone of our framework is an evolutionary algorithm coupled with a local search solver that employs multi-surrogates in the spirit of Lamarckian learning. Inspired by the notion of 'blessing and curse of uncertainty'...
متن کاملA Parallel Memetic Algorithm for Solving Optimization Problems
In this paper we examine 10 different functions in order (a) to test specific parameter of a parallel execution of memetic algorithms and (b) to evaluate the general computational behavior of MAs. The available theoretical analysis on memetic algorithms does not offer a tool which could help in a generalized adjustment of control parameters, leaving the choice of the proper operators, parameter...
متن کاملA memetic algorithm for multi-objective dynamic location problems
This paper describes a new multiobjective interactive memetic algorithm applied to dynamic location problems. The memetic algorithm integrates genetic procedures and local search. It is able to solve capacitated and uncapacitated multi-objective single or multi-level dynamic location problems. These problems are characterized by explicitly considering the possibility of a facility being open, c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2016
ISSN: 0975-8887
DOI: 10.5120/ijca2016908393